Strong Ratio Limit Property for P-recurrent Markov Chains

نویسنده

  • WILLIAM E. PRUITT
چکیده

for some positive integer d, then SRLP holds. It is also shown that the inequality (1.2) is always satisfied in a reversible chain. When P = 1, the results given here reduce to those of Orey [7] for recurrent chains, while for P> 1 they imply SRLP for a class of transient chains. (The definition of SRLP given by Orey required that 7=1 and that r< be independent of i since he was dealing with recurrent chains. The definition given here is the more natural one for transient chains.) The proofs given here were suggested by those used by Orey in the recurrent case. Although the proof given for the lemma is shorter than Orey's, the fundamental difference here is an analytic proof of Theorem 1 to replace the previous probabilistic one.2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ratio Limit Theorems for Markov Chains

Introduction. We consider Markov chains with stationary transition probabilities and state space S = 0, 1, 2, •• -, in both discrete and continuous time. As in [l ] the transition probabilities are denoted by pi}1 (indiscrete time) and pa(t) (in continuous time). We assume that the chains considered are irreducible and recurrent, and in addition that discrete time chains are aperiodic and that ...

متن کامل

Stability of Markovian Processes I: Criteria for Discrete-time Chains

In this paper we connect various topological and probabilistic forms of stability for discrete-time Markov chains. These include tightness on the one hand and Harris recurrence and ergodicity on the other. We show that these concepts of stability are largely equivalent for a major class of chains (chains with continuous components), or if the state space has a sufficiently rich class of appropr...

متن کامل

A Monte Carlo estimation of the entropy for Markov chains

Abstract. We introduce an estimate of the entropy Ept(log p ) of the marginal density p of a (eventually inhomogeneous) Markov chain at time t ≥ 1. This estimate is based on a double Monte Carlo integration over simulated i.i.d. copies of the Markov chain, whose transition density kernel is supposed to be known. The technique is extended to compute the external entropy Ept 1 (log p), where the ...

متن کامل

weak-reversible Markov chains

The theory of L-spectral gaps for reversible Markov chains has been studied by many authors. In this paper we consider positive recurrent general state space Markov chains with stationary transition probabilities. Replacing the assumption of reversibility by a less strong one, we still obtain a simple necessary and sufficient condition for the spectral gap property of the associated Markov oper...

متن کامل

Recurrence for Branching Markov Chains

The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak recurrence and give several new conditions for weak recurrence and strong recurrence. These conditions make a unified treatment of known and new examples possi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010